A Comparison of Free BDDs and Transformed BDDs

Two Solutions to Incorporate Zero, Successor and Equality in Binary Decision Diagrams

In this article we extend BDDs (binary decision diagrams) for plain propositional logic to the fragment of first order logic, consisting of quantifier free logic with equality, zero and successor. We insert equations with zero and successor in BDDs, and call these objects (0, S, =)-BDDs. We extend the notion of Ordered BDDs in the presence of equality, zero and successor. (0, S, =)-BDDs can be ...

Comparison of Decision Diagrams for Multiple-Output Logic Functions

This paper shows four different methods to evaluate multiple-output logic functions using decision diagrams: SBDD, MTBDD, BDD for characteristic functions (CF), and BDDs for ECFNs (Encoded Characteristic Function for Non-zero outputs). Methods to compute average evaluation time for each type of decision diagrams are presented. By experimental analysis using benchmark functions, the number of no...

Appli ation of Linearly Transformed BDDs in Sequential Veri

An Integrated Approach for Combining BDDs and SAT Provers

Many formal verification tools today are based on Boolean proof techniques. The two most powerful approaches in this context are Binary Decision Diagrams (BDDs) and methods based on Boolean Satisfiability (SAT). Recent studies have shown that BDDs and SAT are orthogonal, i.e. there exist problems where BDDs work well, while SAT solvers fail and vice versa. Beside this, the techniques are very d...

Diierential Bdds ?

In this paper, we introduce a class of Binary Decision Diagrams (BDDs) which we call Differential BDDs ( BDDs), and two transformations over BDDs, called Push-up (") and Delta ( ) transformations. In BDDs and its derived classes such as " BDDs or " BDDs, in addition to the ordinary node-sharing in the normal Ordered Binary Decision Diagrams (OBDDs), some isomorphic substructures are collapsed t...